Efficient visibility analysis for massive observers
نویسندگان
چکیده
منابع مشابه
Caratheodory dimension for observers
In this essay we introduce and study the notion of dimension for observers via Caratheodory structures and relative probability measures. We show that the dimension as a three variables function is an increasing function on observers, and decreasing function on the cuts of an observer. We find observers with arbitrary non-negative dimensions. We show that Caratheodory dimension for obs...
متن کاملEfficient visibility processing for projective texture mapping
Projective texture-mapping is a powerful tool for image-based rendering. However, visibility information must be obtained in order to project correct textures onto the geometric sturcture. This paper presents a novel visibility algorithm for determining which polygons are visible from each camera position. It has object-space precision, but operates in both image-space and object-space to get b...
متن کاملEfficient Computation of Visibility Polygons
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computatio...
متن کاملCommunication Efficient Algorithms for Generating Massive Networks
Massive complex systems are prevalent throughout all of our lives, from various biological systems as the human genome to technological networks such as Facebook or Twitter. Rapid advances in technology allow us to gather more and more data that is connected to these systems. Analyzing and extracting this huge amount of information is a crucial task for a variety of scientific disciplines. A co...
متن کاملSpace-efficient Algorithms for Visibility Problems in Simple Polygon
Given a simple polygon P consisting of n vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside P , (ii) the weak visibility polygon of a line segment inside P and (iii) the minimum link path between a pair of points inside P . For problem (i) two algorithms are proposed. The first one is an in-place algorithm where the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.06.018